Almost every 2-SAT function is unate
نویسندگان
چکیده
منابع مشابه
Almost every 2-SAT function is unate
Bollobás, Brightwell and Leader [2] showed that there are at most 2( n 2)+o(n 2) 2-SAT functions on n variables, and conjectured that in fact almost every 2-SAT function is unate: i.e., has a 2-SAT formula in which no variable’s positive and negative literals both appear. We prove their conjecture, finding the number of 2-SAT functions on n variables to be 2( n 2)+n(1 + o(1)). As a corollary of...
متن کاملRings for which every simple module is almost injective
We introduce the class of “right almost V-rings” which is properly between the classes of right V-rings and right good rings. A ring R is called a right almost V-ring if every simple R-module is almost injective. It is proved that R is a right almost V-ring if and only if for every R-module M, any complement of every simple submodule of M is a direct summand. Moreover, R is a right almost V-rin...
متن کاملAlmost 2-SAT is Fixed-Parameter Tractable
We consider the following problem. Given a 2-CNF formula, is it possible to remove at most k clauses so that the resulting 2-CNF formula is satisfiable? This problem is known to different research communities in Theoretical Computer Science under the names ’Almost 2SAT’, ’All-but-k 2-SAT’, ’2-CNF deletion’, ’2-SAT deletion’. The status of fixed-parameter tractability of this problem is a long-s...
متن کاملAlmost Every Domain is Universal
We endow the collection of ω-bifinite domains with the structure of a probability space, and we will show that in this space the collection of all universal domains has measure 1. For this, we present a probabilistic way to extend a finite partial order by one element. Applying this procedure iteratively, we obtain an infinite partial order. We show that, with probability 1, the cpo-completion ...
متن کاملAlmost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
We consider the following problem. Given a 2-cnf formula, is it possible to remove at most k clauses so that the resulting 2-cnf formula is satisfiable? This problem is known to different research communities in theoretical computer science under the names Almost 2-SAT, All-but-k 2-SAT, 2-cnf deletion, and 2-SAT deletion. The status of the fixed-parameter tractability of this problem is a long-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2007
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-007-0081-z